Abstract Beth definability in institutions
نویسندگان
چکیده
منابع مشابه
Beth Definability in Institutions
BETH DEFINABILITY IN INSTITUTIONS MARIUS PETRIA∗ AND RĂZVAN DIACONESCU Abstract. This paper studies definability within the theory of institutions, a version of abstract model This paper studies definability within the theory of institutions, a version of abstract model theory that emerged in computing science studies of software specification and semantics. We generalise the concept of definab...
متن کاملBeth definability in the Guarded Fragment
The guarded fragment (GF) was introduced in [1] as a fragment of first order logic which combines a great expressive power with nice modal behavior. It consists of relational first order formulas whose quantifiers are relativized by atoms in a certain way. While GF has been established as a particularly well-behaved fragment of first order logic in many respects, interpolation fails in restrict...
متن کاملBeth Definability in Expressive Description Logics
The Beth definability property, a well-known property from classical logic, is investigated in the context of description logics (DLs): if a general L TBox implicitly defines an L -concept in terms of a given signature, where L is a DL, then does there always exist over this signature an explicit definition in L for the concept? This property has been studied before and used to optimize reasoni...
متن کاملAlgebraic Characterizations of Various Beth Definability Properties
In this paper it will be shown that the Beth deenability property corresponds to sur-jectiveness of epimorphisms in abstract algebraic logic. This generalizes a result by I. N emeti (cf. HMT85, Theorem 5.6.10]). Moreover, an equally general characterization of the weak Beth property will be given. This gives a solution to Problem 14 in Sai90]. Finally, the characterization of the projective Bet...
متن کاملBeth Definability for the Guarded Fragment
The guarded fragment (GF) was introduced in ABN98] as a fragment of rst order logic which combines a great expressive power with nice modal behavior. It consists of relational rst order formulas whose quantiiers are relativized by atoms in a certain way. While GF has been established as a particularly well-behaved fragment of rst order logic in many respects, interpolation fails in restriction ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2006
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl/1154698588